|
This is the first known correct software solution to the critical section problem for n-processes with a lower bound of n-1 turns presented by Murray A. Eisenberg and Michael R. McGuire. ==Algorithm== All the n-processes share the following variables: enum pstate = ; pstate flags(); int turn; The variable turn is set arbitrarily to a number between 0 and n-1 at the start of the algorithm. The flags variable for each process is set to WAITING whenever it intends to enter the critical section. flags takes either IDLE or WAITING or ACTIVE. Initially the flags variable for each process is initialized to IDLE. repeat 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Eisenberg & McGuire algorithm」の詳細全文を読む スポンサード リンク
|